A Divisible Transferable E-Cash in Wireless Distributed Environment
نویسندگان
چکیده
This paper addresses an elegant and probably unique divisible Wireless E-cash Transfer System in distributed environment. The proposed Wireless E-cash Transfer System solves most of the crucial problem with existing wired e-cash and untraceable e-cash proposals. A distributed computing environment can support multiple platforms, multiple servers and some open networking infrastructure such as Internet. One of such distributed computing architecture is Common Object Request Broker Architecture (CORBA), which is object-oriented, scalable and is based on open specification. We used MICO CORBA and implemented (MIWCO) Wireless CORBA extension for MICO. We had to modify the MICO Core to implement MIWCO. Wireless CORBA architecture has been used in the development and transfer of the e-cash system. In our system we also used LiDIA library for bigint, which is used for security purposes. We used to start Naming Service, Event Service & create Home Location Agent, Access Bridge, Terminal Bridge in implementing the Wireless E-cash Transfer System. The computational complexity of this system is O(n2). We have used binary tree approch to construct a divisible e-cash and at each transfer coin authentication and denomination revelation is checked.
منابع مشابه
Practical Divisible E-Cash
Divisible e-cash systems allow a user to withdraw a wallet containingK coins and to spend k ≤ K coins in a single operation, respectively. Independent of the new work of Canard, Pointcheval, Sanders and Traoré (Proceedings of PKC ’15) we present a practical and secure divisible e-cash system in which the bandwidth of each protocol is constant while the system fulfills the standard security requ...
متن کاملUnlinkable Divisible Electronic Cash
Recently, some divisible electronic cash (e-cash) systems have been proposed. However, in existing divisible e-cash systems, efficiency or unlinkability is not sufficiently accomplished. In the existing efficient divisible cash systems, all protocols are conducted in the order of the polynomial of logN where N is the divisibility precision (i.e., (the total coin amount)/ (minimum divisible unit...
متن کاملImprovement of Efficiency in (Unconditional) Anonymous Transferable E-Cash
The practical advantage expected from transferable e-cash compare to non-transferable is the significant reduction of the interaction number between the bank and the users. However, this property is not fulfilled by anonymous transferable e-cash schemes of the state-of-the art. In this paper, we first present a transferable e-cash scheme with a reduced number of communications between the bank ...
متن کاملPractical Anonymous Divisible E-Cash from Bounded Accumulators
We present an efficient off-line divisible e-cash scheme which is truly anonymous without a trusted third party. This is the second scheme in the literature which achieves full unlinkability and anonymity, after the seminal work proposed by Canard and Gouget. The main trick of our scheme is the use of a bounded accumulator in combination with the classical binary tree approach. The aims of this...
متن کاملAnonymous Transferable E-Cash
Cryptographic e-cash allows off-line electronic transactions between a bank, users and merchants in a secure and anonymous fashion. A plethora of e-cash constructions has been proposed in the literature; however, these traditional e-cash schemes only allow coins to be transferred once between users and merchants. Ideally, we would like users to be able to transfer coins between each other multi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015